Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ALGORITHMS FOR MINIMUM EVOLUTION August 15, 2002 Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle

The Minimum Evolution (ME) approach to phylogeny estimation has been shown to be statistically consistent when it is used in conjunction with ordinary least-squares (OLS) tting of a metric to a tree structure. The traditional approach to using ME has been to start with the Neighbor Joining (NJ) topology for a given matrix, and then do a topological search from that starting point. The rst stage...

متن کامل

ALGORITHMS FOR MINIMUM EVOLUTION August 26, 2002 Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle

The Minimum Evolution (ME) approach to phylogeny estimation has been shown to be statistically consistent when it is used in conjunction with ordinary least-squares (OLS) tting of a metric to a tree structure. The traditional approach to using ME has been to start with the Neighbor Joining (NJ) topology for a given matrix, and then do a topological search from that starting point. The rst stage...

متن کامل

Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle

The Minimum Evolution (ME) approach to phylogeny estimation has been shown to be statistically consistent when it is used in conjunction with ordinary least-squares (OLS) fitting of a metric to a tree structure. The traditional approach to using ME has been to start with the Neighbor Joining (NJ) topology for a given matrix and then do a topological search from that starting point. The first st...

متن کامل

On the Uniqueness of Balanced Minimum Evolution

Minimum evolution is a class of parsimonious distance-based phylogenetic reconstruction methods. One noteworthy example is balanced minimum evolution (BME), which is the theoretical underpinning of the neighbor-joining algorithm. The robustness of a minimum evolution method can be captured in part by a statistic known as its L∞ radius. BME is known to have L∞ radius 1 2 , the best possible. We ...

متن کامل

The Balanced Minimum Evolution Problem

A phylogeny is an unrooted binary tree that represents the evolutionary relationships of a set of n species. Phylogenies find applications in several scientific areas ranging from medical research, to drug discovery, to epidemiology, to systematics, and to population dynamics. In such applications the available information is usually restricted to the leaves of a phylogeny and is represented by...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE/ACM Transactions on Computational Biology and Bioinformatics

سال: 2013

ISSN: 1545-5963

DOI: 10.1109/tcbb.2013.39